Binary partition algorithms and VLSI architectures for median and rank order filtering

نویسندگان

  • Chamg Long Lee
  • Chein-Wei Jen
چکیده

A class of selection algorithms by binary partition is very efficient for median and rank order filtering. A unified discussion of Manuscript received November 23, 1991; revised November 6 , 1992. The associate editor coordinating the review of this correspondence and approving it for publication was Prof. Gonzalo Arce. This work was supported by the National Science Council, Taiwan, Republic of China, under Grant NSC 79-0404-E009-27. C. L. Lee was with the Institute of Electronics Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan, Republic of China. He is now with the Video Signal Processing Department, CCL/ITRI, Taiwan, Republic of China. C.-W. Jen is with the Institute of Electronics and Department of Electronic Engineering, National Chiao Tung University, Hsinehu, Taiwan, Republic of China. IEEE Log Number 9210117 these algorithms is presented. Binary partition algorithms have better time-area complexity than sorting methods. Counting, firing, and updating are three basic steps. A generic structure is proposed to realize these algorithms. They can be implemented by simple and regular modules in VLSI.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VLSI architectures for weighted order statistic (WOS) filters

The class of median filters has been extended to include weighted order statistics (WOS) filters, to improve the flexibility of the filtering operation. The WOS filter weights each input within a sample window, and thus retains the original temporal order information. In this paper, we present efficient VLSI architectures for nonrecursive and recursive WOS filters based on (i) array (ii) stack ...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

Design and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL

A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. &#10The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of fu...

متن کامل

Design and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL

A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of func...

متن کامل

A Novel Multiply-Accumulator Unit Bus Encoding Architecture for Image Processing Applications

In the CMOS circuit power dissipation is a major concern for VLSI functional units. With shrinking feature size, increased frequency and power dissipation on the data bus have become the most important factor compared to other parts of the functional units. One of the most important functional units in any processor is the Multiply-Accumulator unit (MAC). The current work focuses on the develop...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 41  شماره 

صفحات  -

تاریخ انتشار 1993